Analysis of state-independent importance-sampling measures for the two-node tandem queue
نویسندگان
چکیده
منابع مشابه
State-dependent importance sampling for a slowdown tandem queue
In this paper we investigate an advanced variant of the classical (Jackson) tandem queue, viz. a two-node system with server slow-down. The slow-down mechanism has the primary objective to protect the downstream queue from frequent overflows, and it does so by reducing the service speed of the upstream queue as soon as the number of jobs in the downstream queue reaches some pre-specified thresh...
متن کاملAnalysis of a two-node task-splitting feedback tandem queue with infinite buffers by functional equation
Abstract: In this article, a two-node single-processor Markovian tandem queueing system with task splitting and feedback is considered. Each node has an infinite buffer before it and, thus, no blocking is possible in the system. Splitting feature is added to the model considered and it makes it a novel tandem queue. The functional equation developed from the generating function applied to the s...
متن کاملSimple and Efficient Importance Sampling Scheme for a Tandem Queue with Server Slow-down
This paper considers importance sampling as a tool for rare-event simulation. The system at hand is a so-called tandem queue with slow-down, which essentially means that the server of the first queue (or: upstreanm queue) switches to a lower speed when the second queue (downstream queue) exceeds some threshold. The goal is to assess to what extent such a policy succeeds in protecting the first ...
متن کاملImportance sampling algorithms for the fork-join queue
In this paper we consider a rare-event problem in the fork-join queue for which we develop an efficient importance sampling algorithm.
متن کاملImportance Sampling for Weighted-Serve-the-Longest-Queue
This paper considers buffer overflow probabilities for stable queueing systems with one server and different classes of arrivals. The service priority is given to the class of customers whose current weighted queue size is the largest (weighted-serve-the-longest-queue policy). We explicitly identify the exponential decay rate for the rare-event probabilities of interest, and construct asymptoti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Modeling and Computer Simulation
سال: 2006
ISSN: 1049-3301,1558-1195
DOI: 10.1145/1147224.1147226